Nettlesomeness

...Carlsen is demonstrating one of his most feared qualities, namely his “nettlesomeness,” to use a term coined for this purpose by Ken Regan. Using computer analysis, you can measure which players do the most to cause their opponents to make mistakes. Carlsen has the highest nettlesomeness score by this metric, because his creative moves pressure the other player and open up a lot of room for mistakes. In contrast, a player such as Kramnik plays a high percentage of very accurate move...

 Compactness in Linked Hypertext

Global metrics look at extracting information about the graph as a whole. Compactness is a measure of how connected the graph is; a compact graph means that, in general, it is easy to reach a randomlychosen node from another. The usual measure has a range between 0 (totally disconnected nodes) and 1 (universal connections). Compactness of 0 is obviously hopeless for an information space, but perhaps less obviously the graph shouldn't be too compact either; if authors of webpages are sparing a...